Some Algorithmic Problems for Pseudovarieties
نویسنده
چکیده
Several algorithmic problems for pseudovarieties and their relationships are studied. This includes the usual membership problem and the computability of pointlike subsets of nite semi-groups. Some of these problems aaord equivalent formulations involving topological separation properties in free proonite semigroups. Several examples are considered and, as an application, a decidability result for joins is proved.
منابع مشابه
On the join of two pseudovarieties
The aim of this lecture is to survey some recent developments in the theory of finite semigroups. More precisely, we shall consider the following problem about pseudovarieties of semigroups: given two pseudovarieties V and W, find a description of their join V ∨W (that is, of the pseudovariety they generate). This question is motivated by the theory of rational languages: it appears in a natura...
متن کاملSyntactic and Global Semigroup Theory, a Synthesis Approach
This paper is the culmination of a series of work integrating syntactic and global semigroup theoretical approaches for the purpose of calculating semidirect products of pseudovarieties of semigroups. We introduce various abstract and algorithmic properties that a pseudovariety of semi-groups might possibly satisfy. The main theorem states that given a nite collection of pseudovarieties, each s...
متن کاملTameness of some locally trivial pseudovarieties
Tameness is a strong property of semigroup pseudovarieties related to the membership problem. Let κ be the signature comprising semigroup multiplication and the omega implicit operation. We prove the κ-tameness of the pseudovarieties N, D, K and LI.
متن کاملTameness of The Pseudovariety Ls1
A class of finite semigroups V is said to be decidable if the membership problem for V has a solution, that is, if we can construct an algorithm to test whether a given semigroup lies in V. Decidability of pseudovarieties is not preserved by some of the most common pseudovariety operators, such as semidirect product, Mal’cev product and join [1, 17]. In particular Rhodes [17] has exhibited a de...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کامل